Optimal Scheduling of AGVs in a Reentrant Blocking Job-shop
نویسندگان
چکیده
منابع مشابه
Scheduling of a hub reentrant job shop to minimize makespan
This paper focuses on a hub reentrant shop scheduling problem which is motivated by actual packing production line in the iron and steel industry. There are five operations for processing a job where three operations must be processed on a hub machine, and between any two consecutive operations on the hub machine, two operations must be processed on other two secondary machines, respectively. W...
متن کاملA Job Shop Scheduling and Location of Battery Charging Storage for the Automated Guided Vehicles (AGVs)
When the Automated Guided Vehicles (AGVs) are transferring the parts from one machine to another in a job shop environment, it is possible that AGVsstopon their guidepaths since their batteries are discharged.Consequently, it is essential to establish at least one Battery Charging Storage (BCS) to replace full batteries with empty batteries for the stopped AGVs. Due to non-predictable routes fo...
متن کاملJob-shop scheduling in a body shop
We study a generalized job-shop problem called the body shop scheduling problem (BSSP). This problem arises from the industrial application of welding in a car body production line, where possible collisions between industrial robots have to be taken into account. BSSP corresponds to a job-shop problem where the operations of a job have to follow alternating routes on the machines, certain oper...
متن کاملA New Approach in Job Shop Scheduling: Overlapping Operation
In this paper, a new approach to overlapping operations in job shop scheduling is presented. In many job shops, a customer demand can be met in more than one way for each job, where demand determines the quantity of each finished job ordered by a customer. In each job, embedded operations can be performed due to overlapping considerations in which each operation may be overlapped with the other...
متن کاملJob-shop scheduling
The n×m minimum-makespan general job-shop scheduling problem, hereafter referred to as the JSSP, can be described by a set of n jobs {Ji}1≤j≤n which is to be processed on a set of m machines {Mr}1≤r≤m. Each job has a technological sequence of machines to be processed. The processing of job Jj on machine Mr is called the operation Ojr. Operation Ojr requires the exclusive use of Mr for an uninte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia CIRP
سال: 2018
ISSN: 2212-8271
DOI: 10.1016/j.procir.2017.12.173